Design und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence Visual Servoing with Moments of SIFT Features
نویسندگان
چکیده
Robotic manipulation of daily-life objects is an essential requirement in service robotic applications. In that context image based visual servoing is a means to position the end-effector in order to manipulate objects of unknown pose. This contribution proposes a 6 DOF visual servoing scheme that relies on the pixel coordinates, scale and orientation of SIFT features. The control is based on geometric moments computed over an alterable set of redundant SIFT feature correspondences between the current and the reference view. The method is generic as it does not depend on a geometric object model but automatically extracts SIFT features from images of the object. The foundation of visual servoing on generic SIFT features renders the method robust with respect to loss of redundant features caused by occlusion or changes in view point. The moment based representation establishes an approximate one-to-one relationship between visual features and degrees of motion. This property is exploited in the design of a decoupled controller that demonstrates superior performance in terms of convergence and robustness compared with an inverse image Jacobian controller. Several experiments with a robotic arm equipped with a monocular eye-in-hand camera demonstrate that the approach is efficient and reliable.
منابع مشابه
Sonderforschungsbereich 531: Design und Management komplexer Prozesse und Systeme mit Methoden der Computational Intelligence
متن کامل
Design und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence TAKEOVER TIME IN PARALLEL POPULATIONS WITH MIGRATION
The term takeover time regarding selection methods used in evolutionary algorithms denotes the (expected) number of iterations of the selection method until the entire population consists of copies of the best individual, provided that the initial population consists of a single copy of the best individual whereas the remaining individuals are worse. Here, this notion is extended to parallel su...
متن کاملDesign und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence Pareto Set and EMOA Bahavior for Simple Multimodal Multiobjective Functions
Recent research on evolutionary multiobjective optimization has mainly focused on Pareto-fronts. However, we state that proper behavior of the utilized algorithms in decision/search space is necessary for obtaining good results if multimodal objective functions are concerned. Therefore, it makes sense to observe the development of Pareto-sets as well. We do so on a simple, configurable problem,...
متن کاملDesign und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence Pareto Set and EMOA Behavior for Simple Multimodal Multiobjective Functions
Recent research on evolutionary multiobjective optimization has mainly focused on Pareto-fronts. However, we state that proper behavior of the utilized algorithms in decision/search space is necessary for obtaining good results if multimodal objective functions are concerned. Therefore, it makes sense to observe the development of Pareto-sets as well. We do so on a simple, configurable problem,...
متن کاملDesign und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs*
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple randomized optimizers on the maximum clique problem on planar graphs is investigated rigorously. The focus is on the worst-, average-, and semi-average-case behaviors. In semi-random planar graph models an adversary i...
متن کامل